- incoming edge
- SAP.тех. входящее соединение
Универсальный англо-русский словарь. Академик.ру. 2011.
incoming edge
Смотреть что такое "incoming edge" в других словарях:
Incoming — Infobox VG| title = Incoming developer = Rage Software publisher = NA Interplay JP Imagineer designer = Scott Johnson, Kristian Ramsay Jones engine = released =Windows vgrelease|Europe|EU|March 23, 1998 vgrelease|Japan|JP|March 23, 1998… … Wikipedia
IBM WebSphere Edge Server — WebSphere Edge Server (now renamed WebSphere Edge Components ) is a set of web server/application server components that are intended to improve the performance of web based systems. It is part of the IBM WebSphere product suite. It is… … Wikipedia
cutting edge — I (New American Roget s College Thesaurus) n. forefront, avant garde, lead. See priority, precedence. II (Roget s 3 Superthesaurus) (VOCABULARY WORD) n. the forefront; the most advanced. The technology was on the cutting edge. SYN.: forefront,… … English dictionary for students
Dijkstra-Scholten algorithm — The Dijkstra Scholten algorithm is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Scholten in 1980.First, let us consider the case of a simple process graph which is a tree. A… … Wikipedia
Dijkstra–Scholten algorithm — The Dijkstra–Scholten algorithm (named after Edsger W. Dijkstra and C. S. Scholten) is an algorithm for detecting termination in a distributed system. The algorithm was proposed by Dijkstra and Scholten in 1980. First, let us consider the case of … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Pseudoforest — A 1 forest (a maximal pseudoforest), formed by three 1 trees In graph theory, a pseudoforest is an undirected graph[1] in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of ve … Wikipedia
Hungarian algorithm — The Hungarian method is a combinatorial optimization algorithm which solves the assignment problem in polynomial time and which anticipated later primal dual methods. It was developed and published by Harold Kuhn in 1955, who gave the name… … Wikipedia
Clapotis — Incoming wave (red) reflected at the wall produces the outgoing wave (blue), both being overlaid resulting in the clapotis (black). In hydrodynamics, the clapotis (from French: lapping of water ) is a non breaking standing wave pattern, caused… … Wikipedia
Nonimaging optics — (also called anidolic optics)[1][2] is the branch of optics concerned with the optimal transfer of light radiation between a source and a target. Unlike traditional imaging optics, the techniques involved do not attempt to form an image of the… … Wikipedia
Beach cusps — are shoreline formations made up of various grades of sediment in an arc pattern. The horns are made up of coarser materials and the embayment contains all the finer grain sediment. They can be found all over the world and are most noticeable on… … Wikipedia
